Temporal Partitioning to Amortize Reconfiguration Overhead for Dynamically Reconfigurable Architectures
نویسندگان
چکیده
In these days, many dynamically reconfigurable architectures have been introduced to fill the gap between ASICs and softwareprogrammed processors such as GPPs and DSPs. These reconfigurable architectures have shown to achieve higher performance compared to software-programmed processors. However, reconfigurable architectures suffer from a significant reconfiguration overhead and a speedup limitation. By reducing the reconfiguration overhead, the overall performance of reconfigurable architectures can be improved. Therefore, we will describe temporal partitioning, which are able to amortize the reconfiguration overhead at synthesis phase or compilation time. Our temporal partitioning methodology splits a configuration context into temporal partitions to amortize reconfiguration overhead. And then, we will present benchmark results to demonstrate the effectiveness of our methodology. key words: temporal partitioning, reconfigurable architecture, partial reconfiguration, dynamic reconfiguration, run-time reconfiguration and highlevel synthesis
منابع مشابه
Dynamic Reconfigurable Architecture Exploration based on Parameterized Reconfigurable Processor Model
In recent years, dynamic reconfigurable processor which can achieve reconfiguration with a few cycles is proposed. The fast reconfiguration makes run-time reconfiguration possible, and the run-time reconfiguration gives a new possibility to the dynamic reconfigurable processor, i.e. the dynamic reconfigurable processor can also execute partitioned independent subtasks with repeated reconfigurat...
متن کاملHyperreconfigurable systems: formal concepts, architectures, and applications
Dynamically reconfigurable hardware offers promising possibilities for flexible, computation intensive applications. With the technological advance of reconfigurable hardware came a rapid growth in the number of resources per chip requiring large amounts of data transfer per reconfiguration operation. Especially run-time reconfigurable applications, which make frequent use of reconfiguration, s...
متن کاملTask Partitioning for the Scheduling on Reconfigurable Systems driven by Specification Self-Similarity
A new model for the reconfiguration problem on partially dynamically reconfigurable fpgas and a new graph–theoretic algorithm for the temporal and spatial partitioning of a specification on the same vlsi architectures are proposed. A problem in the field of reconfigurable hardware systems is that there is no clear way to partition a given specification in order to implement it on such an archit...
متن کاملHyperreconfigurable architectures and the partition into hypercontexts problem
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increasing flexibility of modern dynamically reconfigurable systems improves their adaptability to computational needs but also makes fast reconfiguration difficult because of the large amount of reconfiguration information ...
متن کاملB1: Analysis of FPGA-Based Reconfiguration Methods for Mobile and Embedded Applications
As mobile and handheld devices are gaining popularity, many applications have found their way into these devices. Apart from optimized hardware-software architectures, new techniques and design methodologies are needed to support applications running on mobile systems. FPGA-based dynamic reconfigurable systems are currently the most feasible option to deliver embedded applications that have str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 90-D شماره
صفحات -
تاریخ انتشار 2007